Invited talk: On Differences in Proofs Between Intuitionistic and Classical Logic

نویسنده

  • Aleksy Schubert
چکیده

The presentation will contrast the complexity results for proving assertions in classical and intuitionistic logic. The comparison will be built upon the known results for propositional logic and predicate one. The predicate case will be based upon the Mints hierarchy in intuitionistic logic which will be contrasted with its counterpart i.e. the prenex hierarchy in classical logic. The di erences in complexity will be illustrated with examples of particular proving mechanisms that are responsible for the divergence, which should facilitate the understanding of where the mathematics is done constructively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

A/z-CALCULUS: AN ALGORITHMIC INTERPRETATION OF CLASSICAL NATURAL DEDUCTION

1 INTRODUCTION This paper presents a way of extending the paradigm "proofs as programs" to classical proofs. The system we use is derived from the general Free Deduction system presented in [31. Usually when considering proofs as programs, one has only in mind some kind of intuitionistic proofs. There is an obvious reason for that restriction: only intuitionistic proofs are contructive, in the ...

متن کامل

On Affine Logic and Łukasiewicz Logic

The multi-valued logic of Lukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation elimination, [DNE]. However, our understanding of Lukasiewicz logic can be improved by separating its classical and intuitionistic aspects. The intuitionistic aspect of Lukasiewicz logic ...

متن کامل

A Logic of Interactive Proofs (Formal Theory of Knowledge Transfer)

We propose a logic of interactive proofs as a framework for an intuitionistic foundation for interactive computation, which we construct via an interactive analog of the Gödel-McKinsey-Tarski-Artëmov definition of Intuitionistic Logic as embedded into a classical modal logic of proofs, and of the Curry-Howard isomorphism between intuitionistic proofs and typed programs. Our interactive proofs e...

متن کامل

A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract)

Classical logic is one of the best examples of a mathematical theory that is truly useful to computer science. Hardware and software engineers apply the theory routinely. Yet from a foundational standpoint, there are aspects of classical logic that are problematic. Unlike intuitionistic logic, classical logic is often held to be non-constructive, and so, is said to admit no proof semantics. To ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016